Logics without the contraction rule and residuated lattices
نویسندگان
چکیده
In this paper, we will develop an algebraic study of substructural propositional logics over FLew, i.e. the logic which is obtained from the intuitionistic logics by eliminating the contraction rule. Our main technical tool is to use residuated lattices as the algebraic semantics for them. This enables us to study different kinds of nonclassical logics, including intermediate logics, BCK-logics, Łukasiewicz’s many-valued logics and fuzzy logics, within a uniform framework. (2009): The draft of the present paper was originally completed in 1999 and then revised slightly in 2001, which I intended to dedicate to R. K. Meyer on the occasion of his 65th birthday. From the middle of 90s, I had been trying to develop an algebraic study of substructural logics over the logic without the contraction rule FLew, and had announced results in several conferences, e.g. the 6th Asian Logic Conference in 1996, Dagstuhl Seminar on Multiple-Valued Logic in 1997 and S. Jaśkowski Memorial Symposium on Parainconsistent Logic, Logical Philosophy, Mathematics & Informatics in 1998. So I planned to make the present paper a comprehensive survey of the state of affairs of the study. While the paper has not been published for many years, the draft has been referred in considerably many papers of substructural logics published in the last decade. On the occasion of the publication of the paper, I have been wondering in which way I should publish the paper and how much I should revise it. For, there have been a remakable progress in the direction of this research within these 10 years, and moreover my joint book [25] on substructural logics was already published. It would be no use to make an entire update of it. Hiroakira Ono, “Logics without the contraction rule”, Australasian Journal of Logic (8) 2010, 50–81 http://www.philosophy.unimelb.edu.au/ajl/2010 51 My decision is to minimize changes, keeping the original form, and to add only necessary information on recent progress. (I put the mark (†) to footnotes which are essentially added in the present revision.) I hope that the paper will be still of interest and also informative, especially in its references, beyond its historical meaning.
منابع مشابه
Classes of residuated lattices
The commutative residuated lattices were first introduced by M. Ward and R.P. Dilworth as generalization of ideal lattices of rings. Non-commutative residuated lattices, called sometimes pseudo-residuated lattices, biresiduated lattices or generalized residuated lattices are algebraic counterpart of substructural logics, that is, logics which lack some of the three structural rules, namely cont...
متن کاملFirst-order Substructural Logics: An Algebraic Approach
Substructural logics have been traditionally characterized as those logics such that, when presented by means of a (sequent) proof system, lack one or more of the usual structural rules: weakening, exchange and contraction. Nonetheless, it is well known that they can also be, very usefully, roughly described as the logics of residuated lattices. Indeed, from this point of view we have seen, spe...
متن کاملSubstructural Logics and Residuated Lattices — an Introduction
This is an introductory survey of substructural logics and of residuated lattices which are algebraic structures for substructural logics. Our survey starts from sequent systems for basic substructural logics and develops the proof theory of them. Then, residuated lattices are introduced as algebraic structures for substructural logics, and some recent developments of their algebraic study are ...
متن کاملEQ-logics with delta connective
In this paper we continue development of formal theory of a special class offuzzy logics, called EQ-logics. Unlike fuzzy logics being extensions of theMTL-logic in which the basic connective is implication, the basic connective inEQ-logics is equivalence. Therefore, a new algebra of truth values calledEQ-algebra was developed. This is a lower semilattice with top element endowed with two binary...
متن کاملFull Lambek Calculus with Contraction is Undecidable
Among propositional substructural logics, these obtained from Gentzen’s sequent calculus for intuitionistic logic (LJ) by removing a subset of the rules contraction (c), exchange (e), left weakening (i), and right weakening (o) play a prominent role, e.g. in [3] such logics are called basic substructural logics. If all above mentioned rules are removed from LJ then the full Lambek calculus is o...
متن کامل